package com.zhengbing.tj.data.complexity;

/**
 * O(n) 时间复杂度示例：线性时间操作
 *
 * @author zhengbing
 * @date 2025-07-22
 */
public class LinearDemo {
    public int sum(int[] arr) {
        int s = 0;
        for (int v : arr) {
            s += v;
        }
        return s;
    }
} 